Multitrip vehicle routing with delivery options: a data-driven application to the parcel industry
نویسندگان
چکیده
Abstract To make the last mile of parcel delivery more efficient, service providers offer an increasing number modes as alternatives to traditional and often cost-intensive home service. Parcel lockers pickup stations can be utilized reduce stops avoid costly detours. design smart networks, must evaluate different business models. In this context, a multitrip vehicle routing problem with options location-dependent costs arises. We present data-driven framework alternative strategies, formulate corresponding model solve heuristically using adaptive large neighborhood search. By examining large, real-life instances from major European service, we determine potential benefits options. Specifically, show that mitigated by consolidating orders in illustrate how pricing applied steer customer demand toward profitable, eco-friendly products.
منابع مشابه
The Vehicle-Routing Problem with Delivery and Back-Haul Options
In this article we consider a version of the vehicle-routing problem (VRP): A fleet of identical capacitated vehicles serves a system of one warehouse and N customers of two types dispersed in the plane. Customers may require deliveries from the warehouse, back hauls to the warehouse, or both. The objective is to design a set of routes of minimum total length to serve all customers, without vio...
متن کاملA Hybrid Metaheuristic Algorithm for the Vehicle Routing Problem with Delivery Time Cost
This paper addresses the Vehicle Routing Problem with Delivery Time Cost. This problem aims to find a set of routes of minimal total costs including the travelling cost and delivery time cost, starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. In this research, a hybrid metaheuristic approa...
متن کاملSTOCHASTIC VEHICLE ROUTING PROBLEMS WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES
The problem of designing a set of routes with minimum cost to serve a collection of customers with a fleet of vehicles is a fundamental challenge when the number of customers to be dropped or picked up is not known during the planning horizon. The purpose of this paper is to develop a vehicle routing Problem (VRP) model that addresses stochastic simultaneous pickup and delivery in the urban pub...
متن کاملThe Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem
This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: OR Spectrum
سال: 2023
ISSN: ['0171-6468', '1436-6304']
DOI: https://doi.org/10.1007/s00291-023-00710-6